Explicit construction of hyperdominant symmetric matrices with assigned spectrum
نویسندگان
چکیده
منابع مشابه
Explicit Solution of the Inverse Eigenvalue Problem of Real Symmetric Matrices and Its Application to Electrical Network Synthesis
A novel procedure for explicit construction of the entries of real symmetric matrices with assigned spectrum and the entries of the corresponding orthogonal modal matrices is presented. The inverse eigenvalue problem of symmetric matrices with some specific sign patterns including hyperdominant one is explicitly solved too. It has been shown to arise thereof a possibility of straightforward sol...
متن کاملAn Explicit Construction of Universally Decodable Matrices
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers L and n and a prime power q. Based on Pascal’s triangle we give an explicit construction of universally decodable matrices for any non-zero integers L and n and any prime power q where L ≤ q + 1. This is the largest set of possible par...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولProperties of Central Symmetric X-Form Matrices
In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.
متن کاملAn Explicit Construction for Neighborly Centrally Symmetric Polytopes
A polytope P ⊂ R is centrally symmetric (cs, for short) if P = −P . A cs polytope P is k-neighborly if every set of k of its vertices, no two of which are antipodes, is the vertex set of a face of P . In their recent paper [7], Linial and Novik give probabilistic constructions for highly neighborly cs polytopes. Namely, based on probabilistic techniques due to Garnaev and Gluskin [4], they cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1997
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(96)00161-9